例句與造句

1. The push relabel algorithm is considered one of the most efficient maximum flow algorithms.
2. Some of them are generalizations of maximum flow algorithms, others use entirely different approaches.
3. She has done some work on network flow algorithms like approximation algorithms for network flows, cut, and clustering problems.
4. Combining this approximation idea with the shortest path augmentation method of the Edmonds Karp algorithm leads to a maximum flow algorithm with running time.
5. The electrical flow algorithm of Christiano, Kelner, Madry, and Spielman finds an approximately optimal maximum flow but only works in undirected graphs.
6. It's difficult to find flow algorithm in a sentence. 用flow algorithm造句挺難的
7. Optical flow algorithms will analyze the footage and make corrections to the picture in order to better " fit " each frame into the new 24 frame sequence.
8. The DMS application utilizes switching management application for this, the losses minimization problem is solved by the optimal power flow algorithm and switching plans are created similar to above function
9. This pre-flow algorithm also used a push operation; however, it used distances in the auxiliary network to determine where to push the flow instead of a labeling system.
10. While LC trees are good for maintaining aggregates on paths of a tree ( making it a good choice data structure in network flow algorithms ), ET trees are better at keeping aggregate information on subtrees.
11. Over the years, various improved solutions to the maximum flow problem were discovered, notably the shortest augmenting path algorithm of Edmonds and Karp and independently Dinitz; the blocking flow algorithm of Dinitz; the Tarjan; and the binary blocking flow algorithm of Goldberg and Rao.
12. Over the years, various improved solutions to the maximum flow problem were discovered, notably the shortest augmenting path algorithm of Edmonds and Karp and independently Dinitz; the blocking flow algorithm of Dinitz; the Tarjan; and the binary blocking flow algorithm of Goldberg and Rao.
13. A flow network is a directed graph G = ( V, E ) with a source vertex s \ in V and a sink vertex t \ in V, where each edge ( u, v ) \ in E has capacity c ( u, v ) > 0, flow f ( u, v ) \ ge 0 and cost a ( u, v ), with most minimum-cost flow algorithms supporting edges with negative costs.